Determining blocking factors for sequential files by heuristic methods
نویسندگان
چکیده
منابع مشابه
Heuristic Methods for Problems with Blocking Constraints Solving Jobshop Scheduling
Jobshop problem is one of the most difficult classical scheduling problems. Very simple special cases of jobshop problem are strongly NP-hard. This paper deals with makespan minimization in jobshop scheduling problems with a specific blocking constraint met in several industrial problems. We also propose and define another new type of blocking constraint. After a problem description and the def...
متن کاملNon-blocking Writes to Files
Writing data to a page not present in the file-system page cache causes the operating system to synchronously fetch the page into memory first. Synchronous page fetch defines both policy (when) and mechanism (how), and always blocks the writing process. Non-blocking writes eliminate such blocking by buffering the written data elsewhere in memory and unblocking the writing process immediately. S...
متن کاملBlocking for Sequential Political Experiments
In typical political experiments, researchers randomize a set of households, precincts, or individuals to treatments all at once, and characteristics of all units are known at the time of randomization. However, in many other experiments, subjects "trickle in" to be randomized to treatment conditions, usually via complete randomization. To take advantage of the rich background data that researc...
متن کاملislanding detection methods for microgrids
امروزه استفاده از منابع انرژی پراکنده کاربرد وسیعی یافته است . اگر چه این منابع بسیاری از مشکلات شبکه را حل می کنند اما زیاد شدن آنها مسائل فراوانی برای سیستم قدرت به همراه دارد . استفاده از میکروشبکه راه حلی است که علاوه بر استفاده از مزایای منابع انرژی پراکنده برخی از مشکلات ایجاد شده توسط آنها را نیز منتفی می کند . همچنین میکروشبکه ها کیفیت برق و قابلیت اطمینان تامین انرژی مشترکان را افزایش ...
15 صفحه اولSequential second derivative general linear methods for stiff systems
Second derivative general linear methods (SGLMs) as an extension of general linear methods (GLMs) have been introduced to improve the stability and accuracy properties of GLMs. The coefficients of SGLMs are given by six matrices, instead of four matrices for GLMs, which are obtained by solving nonlinear systems of order and usually Runge--Kutta stability conditions. In this p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1977
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/20.3.245